0.00/0.00	% File    : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : purification_ext
0.00/0.00	% Ordering    : kbo
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --ho-purify ext \
0.00/0.00	  --ho-ext-axiom \
0.00/0.00	  --restrict-hidden-sup-at-vars \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.20	% Computer   : n042.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 18:44:39 CST 2018
0.00/0.22	% done 25 iterations in 0.013s
0.00/0.22	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
0.00/0.22	% SZS output start Refutation
0.00/0.22	tff('thm/iterate/SUM_UNION_', axiom,
0.00/0.22	  (![A:$tType,A0:(A > 'type/realax/real'),A1:(A > $o),A2:(A > $o)]:
0.00/0.22	     (('const/sets/DISJOINT'(A,A1,A2) & 'const/sets/FINITE'(A,A2) & 
0.00/0.22	       'const/sets/FINITE'(A,A1)) =>
0.00/0.22	      ('const/iterate/sum'(A,'const/sets/UNION'(A,A1,A2),A0) =
0.00/0.22	       'const/realax/real_add'('const/iterate/sum'(A,A1,A0),
0.00/0.22	                               'const/iterate/sum'(A,A2,A0)))))).
0.00/0.22	tff('0', plain,
0.00/0.22	    ![X13 : $tType, X14 : X13 > $o, X15 : X13 > $o, 
0.00/0.22	      X16 : X13 > 'type/realax/real']:
0.00/0.22	      (~ 'const/sets/FINITE'(X13, X14)
0.00/0.22	       | ~ 'const/sets/DISJOINT'(X13, X14, X15)
0.00/0.22	       | ~ 'const/sets/FINITE'(X13, X15)
0.00/0.22	       | 'const/iterate/sum'(X13, 'const/sets/UNION'(X13, X14, X15), X16)
0.00/0.22	          = 'const/realax/real_add'('const/iterate/sum'(X13, X14, X16), 
0.00/0.22	              'const/iterate/sum'(X13, X15, X16))),
0.00/0.22	    inference('cnf', [status(esa)], [thm/iterate/SUM_UNION_])).
0.00/0.22	tff('thm/iterate/SUM_UNION_EQ_', conjecture,
0.00/0.22	  (![A:$tType,A0:(A > 'type/realax/real'),A1:(A > $o),A2:(A > $o),A3:(A > $o)]:
0.00/0.22	     ((('const/sets/UNION'(A,A1,A2) = A3) & 
0.00/0.22	       ('const/sets/INTER'(A,A1,A2) = 'const/sets/EMPTY'(A)) & 
0.00/0.22	       'const/sets/FINITE'(A,A3)) =>
0.00/0.22	      ('const/realax/real_add'('const/iterate/sum'(A,A1,A0),
0.00/0.22	                               'const/iterate/sum'(A,A2,A0)) =
0.00/0.22	       'const/iterate/sum'(A,A3,A0))))).
0.00/0.22	tff(zf_stmt_0, negated_conjecture,
0.00/0.22	  (~
0.00/0.22	    (![A:$tType,A0:(A > 'type/realax/real'),A1:(A > $o),A2:(A > $o),
0.00/0.22	       A3:(A > $o)]:
0.00/0.22	       ((('const/sets/UNION'(A,A1,A2) = A3) & 
0.00/0.22	         ('const/sets/INTER'(A,A1,A2) = 'const/sets/EMPTY'(A)) & 
0.00/0.22	         'const/sets/FINITE'(A,A3)) =>
0.00/0.22	        ('const/realax/real_add'('const/iterate/sum'(A,A1,A0),
0.00/0.22	                                 'const/iterate/sum'(A,A2,A0)) =
0.00/0.22	         'const/iterate/sum'(A,A3,A0)))))).
0.00/0.22	tff('1', plain,
0.00/0.22	    'const/realax/real_add'('const/iterate/sum'(sk_A, sk_A1, sk_A0), 
0.00/0.22	      'const/iterate/sum'(sk_A, sk_A2, sk_A0))
0.00/0.22	     != 'const/iterate/sum'(sk_A, sk_A3, sk_A0),
0.00/0.22	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.22	tff('2', plain,
0.00/0.22	    ('const/iterate/sum'(sk_A, 'const/sets/UNION'(sk_A, sk_A1, sk_A2), sk_A0)
0.00/0.22	      != 'const/iterate/sum'(sk_A, sk_A3, sk_A0)
0.00/0.22	     | ~ 'const/sets/FINITE'(sk_A, sk_A2)
0.00/0.22	     | ~ 'const/sets/DISJOINT'(sk_A, sk_A1, sk_A2)
0.00/0.22	     | ~ 'const/sets/FINITE'(sk_A, sk_A1)),
0.00/0.22	    inference('sup-', [status(thm)], ['0', '1'])).
0.00/0.22	tff('3', plain, 'const/sets/UNION'(sk_A, sk_A1, sk_A2) = sk_A3,
0.00/0.22	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.22	tff('thm/sets/SUBSET_UNION_1', axiom,
0.00/0.22	  (![A:$tType,A0:(A > $o),A1:(A > $o)]:
0.00/0.22	     'const/sets/SUBSET'(A,A0,'const/sets/UNION'(A,A1,A0)))).
0.00/0.22	tff('4', plain,
0.00/0.22	    ![X0 : $tType, X1 : X0 > $o, X2 : X0 > $o]:
0.00/0.22	      'const/sets/SUBSET'(X0, X1, 'const/sets/UNION'(X0, X2, X1)),
0.00/0.22	    inference('cnf', [status(esa)], [thm/sets/SUBSET_UNION_1])).
0.00/0.22	tff('5', plain, 'const/sets/SUBSET'(sk_A, sk_A2, sk_A3),
0.00/0.22	    inference('sup+', [status(thm)], ['3', '4'])).
0.00/0.22	tff('thm/sets/FINITE_SUBSET_', axiom,
0.00/0.22	  (![A:$tType,A0:(A > $o),A1:(A > $o)]:
0.00/0.22	     (('const/sets/SUBSET'(A,A0,A1) & 'const/sets/FINITE'(A,A1)) =>
0.00/0.22	      'const/sets/FINITE'(A,A0)))).
0.00/0.22	tff('6', plain,
0.00/0.22	    ![X6 : $tType, X7 : X6 > $o, X8 : X6 > $o]:
0.00/0.22	      ('const/sets/FINITE'(X6, X7)
0.00/0.22	       | ~ 'const/sets/SUBSET'(X6, X7, X8)
0.00/0.22	       | ~ 'const/sets/FINITE'(X6, X8)),
0.00/0.22	    inference('cnf', [status(esa)], [thm/sets/FINITE_SUBSET_])).
0.00/0.22	tff('7', plain,
0.00/0.22	    (~ $true
0.00/0.22	     | ~ 'const/sets/FINITE'(sk_A, sk_A3)
0.00/0.22	     | 'const/sets/FINITE'(sk_A, sk_A2)),
0.00/0.22	    inference('sup-', [status(thm)], ['5', '6'])).
0.00/0.22	tff('8', plain, 'const/sets/FINITE'(sk_A, sk_A3),
0.00/0.22	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.22	tff('9', plain, (~ $true | ~ $true | 'const/sets/FINITE'(sk_A, sk_A2)),
0.00/0.22	    inference('demod', [status(thm)], ['7', '8'])).
0.00/0.22	tff('10', plain, 'const/sets/FINITE'(sk_A, sk_A2),
0.00/0.22	    inference('simplify', [status(thm)], ['9'])).
0.00/0.22	tff('11', plain,
0.00/0.22	    'const/sets/INTER'(sk_A, sk_A1, sk_A2) = 'const/sets/EMPTY'(sk_A),
0.00/0.22	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.22	tff('12', plain,
0.00/0.22	    ![X1 : sk_A]:
0.00/0.22	      'const/sets/INTER'(sk_A, sk_A1, sk_A2, X1)
0.00/0.22	       = 'const/sets/EMPTY'(sk_A, X1),
0.00/0.22	    inference('ho_complete_eq', [status(thm)], ['11'])).
0.00/0.22	tff('thm/sets/DISJOINT_', axiom,
0.00/0.22	  (![A:$tType,A0:(A > $o),A1:(A > $o)]:
0.00/0.22	     ('const/sets/DISJOINT'(A,A0,A1) <=>
0.00/0.22	      ('const/sets/INTER'(A,A0,A1) = 'const/sets/EMPTY'(A))))).
0.00/0.22	tff('13', plain,
0.00/0.22	    ![X9 : $tType, X10 : X9 > $o, X12 : X9 > $o]:
0.00/0.22	      ('const/sets/DISJOINT'(X9, X10, X12)
0.00/0.22	       | 'const/sets/INTER'(X9, X10, X12) != 'const/sets/EMPTY'(X9)),
0.00/0.22	    inference('cnf', [status(esa)], [thm/sets/DISJOINT_])).
0.00/0.22	tff('14', plain,
0.00/0.22	    ![X9 : $tType, X10 : X9 > $o, X12 : X9 > $o]:
0.00/0.22	      ('const/sets/DISJOINT'(X9, X10, X12)
0.00/0.22	       | 'const/sets/INTER'(X9, X10, X12, '#k2'(X9, X10, X12))
0.00/0.22	          != 'const/sets/EMPTY'(X9, '#k2'(X9, X10, X12))),
0.00/0.22	    inference('rw_lit', [status(thm)], ['13'])).
0.00/0.22	tff('15', plain,
0.00/0.22	    ('const/sets/EMPTY'(sk_A, '#k2'(sk_A, sk_A1, sk_A2))
0.00/0.22	      != 'const/sets/EMPTY'(sk_A, '#k2'(sk_A, sk_A1, sk_A2))
0.00/0.22	     | 'const/sets/DISJOINT'(sk_A, sk_A1, sk_A2)),
0.00/0.22	    inference('sup-', [status(thm)], ['12', '14'])).
0.00/0.22	tff('16', plain, 'const/sets/DISJOINT'(sk_A, sk_A1, sk_A2),
0.00/0.22	    inference('simplify', [status(thm)], ['15'])).
0.00/0.22	tff('thm/sets/SUBSET_UNION_0', axiom,
0.00/0.22	  (![A:$tType,A0:(A > $o),A1:(A > $o)]:
0.00/0.22	     'const/sets/SUBSET'(A,A0,'const/sets/UNION'(A,A0,A1)))).
0.00/0.22	tff('17', plain,
0.00/0.22	    ![X3 : $tType, X4 : X3 > $o, X5 : X3 > $o]:
0.00/0.22	      'const/sets/SUBSET'(X3, X4, 'const/sets/UNION'(X3, X4, X5)),
0.00/0.22	    inference('cnf', [status(esa)], [thm/sets/SUBSET_UNION_0])).
0.00/0.22	tff('18', plain, 'const/sets/SUBSET'(sk_A, sk_A1, sk_A3),
0.00/0.22	    inference('sup+', [status(thm)], ['3', '17'])).
0.00/0.22	tff('19', plain,
0.00/0.22	    (~ $true
0.00/0.22	     | ~ 'const/sets/FINITE'(sk_A, sk_A3)
0.00/0.22	     | 'const/sets/FINITE'(sk_A, sk_A1)),
0.00/0.22	    inference('sup-', [status(thm)], ['18', '6'])).
0.00/0.22	tff('20', plain, (~ $true | ~ $true | 'const/sets/FINITE'(sk_A, sk_A1)),
0.00/0.22	    inference('demod', [status(thm)], ['19', '8'])).
0.00/0.22	tff('21', plain, 'const/sets/FINITE'(sk_A, sk_A1),
0.00/0.22	    inference('simplify', [status(thm)], ['20'])).
0.00/0.22	tff('22', plain,
0.00/0.22	    ('const/iterate/sum'(sk_A, sk_A3, sk_A0)
0.00/0.22	      != 'const/iterate/sum'(sk_A, sk_A3, sk_A0)
0.00/0.22	     | ~ $true
0.00/0.22	     | ~ $true
0.00/0.22	     | ~ $true),
0.00/0.22	    inference('demod', [status(thm)], ['2', '3', '10', '16', '21'])).
0.00/0.22	tff('23', plain, $false, inference('simplify', [status(thm)], ['22'])).
0.00/0.22	
0.00/0.22	% SZS output end Refutation
0.00/0.22	EOF
